Permutation Tests for Correlation between Two Distance Matrices
نویسنده
چکیده
Biologists frequently summarize multivariate data from n populations by computing some measure of distance between populations. The problem then arises of comparing two such pairwise distance matrices based on different characters. A permutation test for correlation between distance matrices is proposed. This test, based on Kendall's tau statistic, is compared to Pearson's product-moment and Spearman's rho tests for the same problem. Examples are presented, and computation is discussed.
منابع مشابه
Comparison of Permutation Methods for the Partial Correlation and Partial Mantel Tests
This study compares empirical type I error and power of different permutation techniques that can be used for partial correlation analysis involving three data vectors and for partial Mantel tests. The partial Mantel test is a form of first-order partial correlation analysis involving three distance matrices which is widely used in such fields as population genetics, ecology, anthropology, psyc...
متن کاملLASR 2007 — Systems
Bioinformatics sample summaries often involve distances or the conversion of similarities to dissimilarities, while Procrustes methods can proceed either via distances or via the shape coordinates underlying those distances. There is a distance–distance statistical method, currently increasing in popularity in some of my applications domains, that is at once simple, intuitive, and quite wronghe...
متن کاملQUASI-PERMUTATION REPRESENTATIONS OF METACYCLIC 2-GROUPS
By a quasi-permutation matrix we mean a square matrix over the complex field C with non-negative integral trace. Thus, every permutation matrix over C is a quasipermutation matrix. For a given finite group G, let p(G) denote the minimal degree of a faithful permutation representation of G (or of a faithful representation of G by permutation matrices), let q(G) denote the minimal degree of a fa...
متن کاملQUASI-PERMUTATION REPRESENTATIONS OF SUZtTKI GROUP
By a quasi-permutation matrix we mean a square matrix over the complex field C with non-negative integral trace. Thus every permutation matrix over C is a quasipermutation matrix. For a given finite group G, let p(G) denote the minimal degree of a faithful permutation representation of G (or of a faithful representation of G by permutation matrices), let q(G) denote the minimal degree of a fai...
متن کاملAssessing Congruence Among Ultrametric Distance Matrices
Recently, a test of congruence among distance matrices (CADM) has been developed. The null hypothesis is the incongruence among all data matrices. It has been shown that CADM has a correct type I error rate and good power when applied to independently-generated distance matrices. In this study, we investigate the suitability of CADM to compare ultrametric distance matrices. We tested the type I...
متن کامل